Left Eigenvector of a Stochastic Matrix
نویسندگان
چکیده
منابع مشابه
Clustering by Left-Stochastic Matrix Factorization
We propose clustering samples given their pairwise similarities by factorizing the similarity matrix into the product of a cluster probability matrix and its transpose. We propose a rotation-based algorithm to compute this left-stochastic decomposition (LSD). Theoretical results link the LSD clustering method to a soft kernel k-means clustering, give conditions for when the factorization and cl...
متن کاملLocalized eigenvector of the non-backtracking matrix
Emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning. The spectral method using the non-backtracking matrix was proposed as a way to overcome this problem. The numerical experiments on several examples of real networks show that, indeed, the non-backtracking matrix does not exhibit localization of eigenvectors. We show that, however, localiz...
متن کاملOn Computing an Eigenvector of a Tridiagonal Matrix
We consider the solution of the homogeneous equation J I x where J is a tridiagonal matrix is a known eigenvalue and x is the unknown eigenvector corresponding to Since the system is under determined x could be obtained by setting xk and solving for the rest of the elements of x This method is not entirely new and it can be traced back to the times of Cauchy In Wilkinson demonstrated that in ni...
متن کاملOn Jordan left derivations and generalized Jordan left derivations of matrix rings
Abstract. Let R be a 2-torsion free ring with identity. In this paper, first we prove that any Jordan left derivation (hence, any left derivation) on the full matrix ringMn(R) (n 2) is identically zero, and any generalized left derivation on this ring is a right centralizer. Next, we show that if R is also a prime ring and n 1, then any Jordan left derivation on the ring Tn(R) of all n×n uppe...
متن کاملSimilarity-based clustering by left-stochastic matrix factorization
For similarity-based clustering, we propose modeling the entries of a given similarity matrix as the inner products of the unknown cluster probabilities. To estimate the cluster probabilities from the given similarity matrix, we introduce a left-stochastic non-negative matrix factorization problem. A rotation-based algorithm is proposed for the matrix factorization. Conditions for unique matrix...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Pure Mathematics
سال: 2011
ISSN: 2160-0368,2160-0384
DOI: 10.4236/apm.2011.14023